Then we propose a union algorithm to combine two sets of implication rules for the requirement of distributed applications 在此基礎上,針對分布式應用的需要,合肥工業(yè)大學碩士學位論文我們提出一種蘊涵規(guī)則的并運算算法,考慮如何將兩組蘊涵規(guī)則集加以合并。
4 ) we introduce a classical algorithm which can extract implication rules based on concept lattice . the algorithm builds lattice incrementally and updates the set of rules simultaneously . we modify the structure of lattic to meet our requirement of finding frequent itemsets (4)介紹一種經(jīng)典的基于概念格的提取蘊涵規(guī)則的算法,該算法增量式建格,同時更新規(guī)則集,我們根據(jù)需要對格結構進行相應修改,從而可以增量式獲取頻繁項集。